Extended use of error-free transformation for real matrix multiplication to complex matrix multiplication
نویسندگان
چکیده
منابع مشابه
SHORT-SS4: Error-Free Transformation of Matrix Multiplication by A Posteriori Verification
This paper is concerned with accurate computations for matrix multiplication. An error-free transformation of matrix multiplication is developed by the authors. It transforms a product of two floatingpoint matrices to a sum of several floating-point matrices by using only floating-point arithmetic. This transformation is useful not only for accurate matrix multiplication but also for interval e...
متن کاملOn-line soft error correction in matrix-matrix multiplication
Soft errors are one-time events that corrupt the state of a computing system but not its overall functionality. Soft errors normally do not interrupt the execution of the affected program, but the affected computation results cannot be trusted any more. A well known technique to correct soft errors in matrix–matrix multiplication is algorithm-based fault tolerance (ABFT). While ABFT achieves mu...
متن کاملAlgorithms for Matrix Multiplication
Strassen’s and Winograd’s algorithms for n × n matrix multiplication are investigated and compared with the normal algorithm. The normal algorithm requires n3 + O(n2) multiplications and about the same number of additions. Winograd’s algorithm almost halves the number of multiplications at the expense of more additions. Strassen’s algorithm reduces the total number of operations to O(n2.82) by ...
متن کاملPushing the Bounds for Matrix-Matrix Multiplication
A tight lower bound for required I/O when computing a matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker lower bounds by reasoning about the number of phases needed to perform C := AB, where each phase is a series of operations involving S reads and writes to and from fast memory, and S is the size of fast memory. A lower bound on th...
متن کاملGenerating Vector Code for Matrix-matrix Multiplication
The current state of the art Matrix-Matrix-Multiplication (MMM) kernel is known as ATLAS, which generates the best performing MMM code by search. However, today’s computer architecture changes rapidly and it is hard to generate a high performance code without knowing how to use the new instruction sets. Since ATLAS does not make use of blocking for L2 cache, or SSE/SSE2 instruction, we are enco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1821/1/012022